Comparative Study of Approximate Multipliers
نویسندگان
چکیده
Approximate multipliers are widely being advocated for energy-efficient computing in applications that exhibit an inherent tolerance to inaccuracy. However, the inclusion of accuracy as a key design parameter, besides the performance, area and power, makes the identification of the most suitable approximate multiplier quite challenging. In this paper, we identify three major decision making factors for the selection of an approximate multipliers circuit: (1) the type of approximate full adder (FA) used to construct the multiplier, (2) the architecture, i.e., array or tree, of the multiplier and (3) the placement of sub-modules of approximate and exact multipliers in the main multiplier module. Based on these factors, we explored the design space for circuit level implementations of approximate multipliers. We used circuit level implementations of some of the most widely used approximate full adders, i.e., approximate mirror adders, XOR/XNOR based approximate full adders and Inexact adder cell. These FA cells are then used to develop circuits for the approximate high order compressors as building blocks for 8x8 array and tree multipliers. We then develop various implementations of higher bit multipliers by using a combination of exact and inaccurate 8x8 multiplier cells. All these implementations have been done using the Cadence’s Spectre tool with the TSMC65nm technology. The design space of these multipliers is explored based on their power, area, delay and error and the best approximate multiplier designs are identified. The report also presents the validation of our results using an image blending application. An open source library of implemented cells and multiplier circuits are available online. Keywords— Approximate Computing, Approximate Multiplier, Power-Efficiency, Error Metrics, Circuit Characteristics, Comparative Study
منابع مشابه
Comparative Analysis of Sectoral Multipliers of Input-Output Model and Social Accounting Matrix
The present study is to indicate that the comparison between sectoral production multipliers of an input-output (I/O) model and a social accounting matrix (SAM) framework is almost impossible without taking into account accounting balances and theoretical considerations. Theoretically, the I/O model provides the Leontief’s production function, on the basis of which sectoral output multiplier ca...
متن کاملConvergent discretization of heat and wave map flows to spheres using approximate discrete Lagrange multipliers
We propose fully discrete schemes to approximate the harmonic map heat flow and wave maps into spheres. The finite-element based schemes preserve a unit length constraint at the nodes by means of approximate discrete Lagrange multipliers, satisfy a discrete energy law, and iterates are shown to converge to weak solutions of the continuous problem. Comparative computational studies are included ...
متن کاملAnalysis of squeezing flow of viscous fluid under the influence of slip and magnetic field: comparative studies of different approximate analytical methods
The various industrial and engineering applications of flow of fluid between parallel plates have continued to generate renewed interests. In this work, a comparative study of approximate analytical methods is carried out using differential transformation,homotopy perturbation, Adomian decomposition, variation of parameter and variational iteration methods for the analysis of a steady two-dimen...
متن کاملSuperstability of Multipliers and Ring Derivations on Banach Algebras
In this paper, we will consider Hyers–Ulam–Rassias stability of multipliers and ring derivations between Banach algebras. As a corollary, we will prove superstability of ring derivations and multipliers. That is, approximate multipliers and approximate ring derivations are exact multipliers and ring derivations.
متن کاملMicrosoft Word - Final_Feb_20_R4Booth_Mult_Brief
Approximate computing is an attractive design methodology to achieve low power, high performance (low delay) and reduced circuit complexity by relaxing the requirement of accuracy. In this paper, approximate Booth multipliers are designed based on approximate radix-4 modified Booth encoding (MBE) algorithms and a regular partial product array that employs an approximate Wallace tree. Two approx...
متن کامل